On Sharp Thresholds in Random Geometric Graphs
نویسندگان
چکیده
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model of random k-SAT exhibits a sharp threshold for satisfiability.
منابع مشابه
Monotone properties of random geometric graphs have sharp thresholds
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1]d, and connecting two points if their Euclidean distance is at most r, for some prescribed r. We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of n points distributed uniformly in [0, 1]d. We pres...
متن کاملMonotone Properties of Random Geometric Graphs Have Sharp Thresholds By
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0,1]d , and connecting two points if their Euclidean distance is at most r , for some prescribed r . We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of n points distributed uniformly in [0,1]d . We pr...
متن کاملThe distant-2 chromatic number of random proximity and random geometric graphs
We are interested in finding bounds for the distant-2 chromatic number of geometric graphs drawn from different models. We consider two undirected models of random graphs: random geometric graphs and random proximity graphs for which sharp connectivity thresholds have been shown. We are interested in a.a.s. connected graphs close just above the connectivity threshold. For such subfamilies of ra...
متن کاملA curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node
One-dimensional geometric random graphs are constructed by distributing n nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most rn. These graphs have received much interest and been used in various applications including wireless networks. A threshold of rn for connectivity is known as r∗ n = lnn n in the li...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کامل